Star-crossed cube: an alternative to star graph
نویسندگان
چکیده
This paper introduces a new interconnection network topology called the star-crossed cube (SCQ). The SCQ is observed to be superior to other contemporary networks in terms of various topological parameters such as diameter, cost, average distance, and message traffic density. The various performance metrics of the proposed network, including cost effectiveness and time-cost effectiveness, are found to be better. The optimal routing and broadcasting algorithms for the new network are also presented. Embedding properties for the proposed network are also studied.
منابع مشابه
Vulnerability issues of star graphs, alternating group graphs and split-stars: strength and toughness
Akers et al. (Proceedings of the International Conference on Parallel Processing, 1987, pp. 393–400) proposed an interconnection topology, the star graph, as an alternative to the popular n-cube. Jwo et al. (Networks 23 (1993) 315–326) studied the alternating group graph An. Cheng et al. (Super connectivity of star graphs, alternating group graphs and split-stars, Ars Combin. 59 (2001) 107–116)...
متن کاملTopological Properties and Broadcasting Algorithms of the Generalized-Star Cube
In this research, another version of the star cube called the generalized-star cube, GSC(n, k,m), is presented as a three level interconnection topology. GSC(n, k,m) is a product graph of the (n, k)-star graph and the m-dimensional hypercube (m-cube). It can be constructed in one of two ways: to replace each node in an m-cube with an (n, k)-star graph, or to replace each node in an (n, k)-star ...
متن کاملThe spectrum of the hyper-star graphs and their line graphs
Let n 1 be an integer. The hypercube Qn is the graph whose vertex set isf0;1gn, where two n-tuples are adjacent if they differ in precisely one coordinate. This graph has many applications in Computer sciences and other area of sciences. Inthe graph Qn, the layer Lk is the set of vertices with exactly k 1’s, namely, vertices ofweight k, 1 k n. The hyper-star graph B(n;k) is...
متن کاملBroadcasting Algorithms for the Star-Connected Cycles Interconnection Network
| The star-connected cycles (SCC) graph was recently proposed as an alternative to the cube-connected cycles (CCC) graph, using a star graph to connect cycles of nodes rather than a hypercube. This paper presents an analysis of broadcasting algorithms for SIMD and MIMD SCCs, covering both one-port and multiple-port versions. We show that O(n log n) one-port broadcasting algorithms that have bee...
متن کاملOn Edge-Decomposition of Cubic Graphs into Copies of the Double-Star with Four Edges
A tree containing exactly two non-pendant vertices is called a double-star. Let $k_1$ and $k_2$ be two positive integers. The double-star with degree sequence $(k_1+1, k_2+1, 1, ldots, 1)$ is denoted by $S_{k_1, k_2}$. It is known that a cubic graph has an $S_{1,1}$-decomposition if and only if it contains a perfect matching. In this paper, we study the $S_{1,2}$-decomposit...
متن کامل